Block Toeplitz Methods in Polynomial Matrix Computations

نویسندگان

  • J. C. Zúñiga
  • D. Henrion
چکیده

Some block Toeplitz methods applied to polynomial matrices are reviewed. We focus on the computation of the structure (rank, null-space, infinite and finite structures) of an arbitrary rectangular polynomial matrix. We also introduce some applications of this structural information in control theory. All the methods outlined here are based on the computation of the null-spaces of suitable block Toeplitz matrices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical Stability of Block Toeplitz Algorithms in Polynomial Matrix Computations

We study the problem of computing the eigenstructure of a polynomial matrix. Via a backward error analysis we analyze the stability of some block Toeplitz algorithms to obtain this eigenstructure. We also elaborate on the nature of the problem, i.e. conditioning and posedness. Copyright c ©2005 IFAC.

متن کامل

Look - ahead schemes for block Toeplitz systems and formalorthogonal matrix polynomials

In this paper, a so-called auxiliary matrix polynomial Xn(z) and a true right formal orthogonal matrix polynomial (FOMP) A 1 n (z) is connected to each well-conditioned leading principal block submatrix of a given block Toeplitz matrix. From these two matrix polynomi-als, all other right FOMPs of block n of a system of block biorthogonal matrix polynomials with respect to the block Toeplitz mom...

متن کامل

Ldu Factorization Results for Bi - Infinite Andsemi - Infinite Scalar and Block Toeplitz

In this article various existence results for the LDU-factorization of semi-innnite and bi-innnite scalar and block Toeplitz matrices and numerical methods for computing them are reviewed. Moreover, their application to the orthonor-malization of splines is indicated. Both banded and non-banded Toeplitz matrices are considered. Extensive use is made of matrix polynomial theory. Results on the a...

متن کامل

Ldu Factorization Results for Bi-infinite and Semi-infinite Scalar and Block Toeplitz Matrices

ABSTllACT-In this article various existence results for the LDU-factorization of semi-infinite and bi-infinite scalar and block Toeplitz matrices and numerical methods for computing them are reviewed. Moreover, their application to the orthonormal-ization of splines is indicated. Both banded and non-banded Toeplitz matrices are considered. Extensive use is made of matrix polynomial theory. Resu...

متن کامل

A Toeplitz algorithm for polynomial J-spectral factorization

A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can have zeros along the imaginary axis. The key assumption is that the finite zeros of the input polynomial matrix are given as input data. The algorithm is based on numerically reliable operations only, namely computation ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004